package com.wyw.leetcode.learning.simple;

/**
 * leetcode topic 704
 * 二分查找
 *
 * @Author Mr Wu （yewen.wu.china@gmail.com）
 * @Date 2021/11/3 16:03
 */
public class Topic704 {
    public static void main(String[] args) {
        int[] nums = {-1,0,3,5,9,12};
        search(nums, 2);
    }

    public static int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1;
        while (left <= right){
            int mid = left + (right - left) / 2;
            if (nums[mid] > target) {
                right = mid - 1;
            } else if(nums[mid] < target) {
                left = mid + 1;
            } else {
                return mid;
            }
        }
        return -1;
    }
}
